A secure version of asymptotic numerical method via convergence acceleration
نویسندگان
چکیده
منابع مشابه
Asymptotic Convergence of Backpropagation: Numerical Experiments
Yu He Dept. of Physics Ohio State Univ. Columbus, OH 43212 We have calculated, both analytically and in simulations, the rate of convergence at long times in the backpropagation learning algorithm for networks with and without hidden units. Our basic finding for units using the standard sigmoid transfer function is lit convergence of the error for large t, with at most logarithmic corrections f...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملSurvey of numerical stability issues in convergence acceleration
A cardinal issue that arises in application of convergence acceleration (extrapolation) methods is that of numerical stability (rather lack of it) in floating-point arithmetic. This issue turns out to be critical because numerical instability is inherent, even built in, when convergence acceleration methods are applied to many sequences that occur commonly in practice. It is encountered, for ex...
متن کاملA Numerical Solution of Troesch’s Problem via Optimal Homotopy Asymptotic Method
Troesch’s problem arose while the investigation of the confinement of a plasma column by applying radiation pressure was being conducted. It is an unstable problem in itself, with a two-point boundary value. The application of the Optimal Homotopy Asymptotic Method (OHAM) is used to attain an approximate solution for the nonlinear differential equation which provides and apt description of Troe...
متن کاملAsymptotic Waveform Evaluation via a Lanczos Method
In this paper we show that the two-sided Lanczos procedure combined with implicit restarts, offers significant advantages over Pad6 approximations used typically for model reduction in circuit simulation. Keywords-Dynamical systems, Model reduction, Numerical methods, Pad6 approximation, Lanczos algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus. Mécanique
سال: 2020
ISSN: 1873-7234
DOI: 10.5802/crmeca.48